翻訳と辞書
Words near each other
・ Khisa
・ Khisa language
・ Khish Eshkan
・ Khishig-Öndör
・ Khishigbatyn Erdenet-Od
・ Khishigdalain Battulga
・ Khishigten
・ Khishortob
・ Khislavichi
・ Khislavichsky District
・ Khisoki Darv
・ Khingz
・ Khinialon
・ Khinjan District
・ Khinkali
Khintchine inequality
・ Khinvsar
・ Khinwara
・ Khinwasar
・ KHIO
・ Khioniya Guseva
・ KHIP
・ Khipa
・ Khiprianwala Island
・ Khipro
・ Khir Johari
・ Khir language
・ Khir Rural District
・ Khir Sar
・ Khir Toyo


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Khintchine inequality : ウィキペディア英語版
Khintchine inequality
In mathematics, the Khintchine inequality, named after Aleksandr Khinchin and spelled in multiple ways in the Roman alphabet, is a theorem from probability, and is also frequently used in analysis. Heuristically, it says that if we pick N complex numbers x_1,\dots,x_N \in\mathbb, and add them together each multiplied by a random sign \pm 1 , then the expected value of its modulus, or the modulus it will be closest to on average, will be not too far off from \sqrt}.
==Statement of theorem==

Let \_^ be i.i.d. random variables
with P(\epsilon_n=\pm1)=\frac12 for every n=1\ldots N,
i.e., a sequence with Rademacher distribution.
Let 0 and let x_1,...,x_N\in \mathbb.
Then
: A_p \left( \sum_^|x_|^ \right)^} \leq \left(\mathbb\Big|\sum_^\epsilon_x_\Big|^ \right)^ \leq B_p \left(\sum_^|x_|^\right)^}
for some constants A_p,B_p>0 depending only on p (see Expected value for notation). The sharp values of the constants A_p,B_p were found by Haagerup (Ref. 2; see Ref. 3 for a simpler proof). It is a simple matter to see that A_p = 1 when p \ge 2, and B_p = 1 when 0 < p \le 2.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Khintchine inequality」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.